The cover time of regular random graphs
نویسندگان
چکیده
Let r ≥ 3 be integer, and let Gr denote the set of r-regular graphs with vertex set V = {1, 2, . . . , n}. Let G be chosen randomly from Gr. We prove that whp the cover time of a random walk on G is asymptotic to r−1 r−2 n log n.
منابع مشابه
On the Cover Time of Random Walks on Graphs
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound of O(n 2) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of s log n) for the expected cover time...
متن کاملEdge Cover Time for Regular Graphs
Consider the following stochastic process on a graph: initially all vertices are uncovered and at each step cover the two vertices of a random edge. What is the expected number of steps required to cover all vertices of the graph? In this note we show that the mean cover time for a regular graph of N vertices is asymptotically (N log N)/2. Moreover, we compute the exact mean cover time for some...
متن کاملRandom Regular Graph: Generation and Cover Time
A graph is r-regular if all its vertices have the same degree r. A random r-regular graph with n vertices is a graph sampled uniformly at random from the set of all r-regular graphs on n vertices. There are various sampling methods for this. In this report we survey one of them: The Configuration Model. We then survey the cover time of a random walk on such a graph, which roughly speaking, is t...
متن کاملA 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomial-time 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are ...
متن کاملCover Time and Broadcast Time
We introduce a new technique for bounding the cover time of random walks by relating it to the runtime of randomized broadcast. In particular, we strongly confirm for dense graphs the intuition of Chandra et al. [8] that “the cover time of the graph is an appropriate metric for the performance of certain kinds of randomized broadcast algorithms”. In more detail, our results are as follows: • Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007